Reducible Complexity in Dns
نویسندگان
چکیده
DNS is one of the most important components of the Internet infrastructure. Unfortunately, it is known to be difficult to implement, and available implementations are difficult to configure correctly. DNS performance and availability often suffer from poor configuration which leads to unavailability or erroneous behavior of distributed systems that depend on DNS. The data structures of DNS are historically grown. Some are no longer needed, some have changed their semantics. However, they have to be maintained by implementations. We measure the extent and configuration issues in DNS data and propose simplifications to DNS data types and semantics that would allow building more dependable implementations. New DNS implementations could also reduce complexity by ignoring certain functionality of DNS that are not needed or that can be implemented in other ways.
منابع مشابه
On the reducible $M$-ideals in Banach spaces
The object of the investigation is to study reducible $M$-ideals in Banach spaces. It is shown that if the number of $M$-ideals in a Banach space $X$ is $n(<infty)$, then the number of reducible $M$-ideals does not exceed of $frac{(n-2)(n-3)}{2}$. Moreover, given a compact metric space $X$, we obtain a general form of a reducible $M$-ideal in the space $C(X)$ of continuous functions on $X$. The...
متن کاملSeparating the Notions of Self- and Autoreducibility
Recently Glaÿer et al. have shown that for many classes C including PSPACE and NP it holds that all of its nontrivial many-one complete languages are autoreducible. This immediately raises the question of whether all many-one complete languages are Turing self-reducible for such classes C. This paper considers a simpler version of this question whether all PSPACE-complete (NPcomplete) languages...
متن کاملOn the Performance and Analysis of DNS Security Extensions
The Domain Name System (DNS) is an essential component of the critical infrastructure of the Internet. The role of DNS is vital, as it is involved in virtually every Internet transaction. It is sometimes remarked that DNS works well as it is now and any changes to it may disrupt its functionality and add complexity. However, due to its importance, an insecure DNS is unacceptable for current and...
متن کاملOn the reducibility of sets inside NP to sets with low information content
We study whether sets inside NP can be reduced to sets with low information content but possibly still high computational complexity. Examples of sets with low information content are tally sets, sparse sets, P-selective sets and membership comparable sets. For the graph automorphism and isomorphism problems GA and GI, for the directed graph reachability problem GAP, for the determinant functio...
متن کاملModules with Reducible Complexity, Ii
We continue studying the class of modules having reducible complexity over a local ring. In particular, a method is provided for computing an upper bound of the complexity of such a module, in terms of vanishing of certain cohomology modules. We then specialize to complete intersections, which are precisely the rings over which all modules have finite complexity.
متن کامل